Completion Latin Square for Wavelength Routing
نویسندگان
چکیده
Optical network uses a tool for routing called Latin router. These routers use particular algorithms for routing. For example, we can refer to LDF algorithm that uses backtracking (one of CSP methods) for problem solving. In this paper, we proposed new approached for completion routing table (DRA&CRA algorithm) and compare with pervious proposed ways and showed numbers of backtracking, blocking and run time for DRA algorithm less than LDF and CRA algorithm. Keywords—Latin Router, Constraint Satisfaction Problem, Wavelength Routing.
منابع مشابه
Using of Latin Router for Routing Wavelength with Configuration Algorithm
Optical network uses a tool for routing which is called Latin router. These routers use particular algorithms for routing. In this paper, we present algorithm for configuration of optical network that is optimized regarding previous algorithm. We show that by decreasing the number of hops for source-destination in lightpath number of satisfied request is less. Also we had shown that more than s...
متن کاملLP as a Global Search Heuristic Across Different Constrainedness Regions
We study the behavior of heuristics based on the LP relaxation with respect to the underlying constraindness of the problem. Our study focuses on the Latin square (or quasigroup) completion problem [1]) as a prototype for highly combinatorial problems. We find that simple techniques based on the LP relaxation of the problem provide satisfactory guidance for underand over-constrained instances. ...
متن کاملOn maximal premature partial Latin squares
A partial Latin square is premature if it has no completion, but it admits a completion after removing any of its symbols. This type of partial Latin square has been introduced by Brankovic, Honik, Miller and Rosa [Ars Combinatoria, to appear] where the authors showed that the number of empty cells in an n x n premature latin square is at least 371 4. vVe improve this lower bound to 7n/2 0(71,).
متن کاملOn the Completion of Partial Latin Squares
In this paper a certain condition on partial latin squares is shown to be sufficient to guarantee that the partial square can be completed, namely, that it have fewer than n entries, and that at most [(n + I)/21 of these lie off some line,where n is the order of the square. This is applied to establish that the Evans conjecture is true for n < 8; i.e., that given a partial latin square of order...
متن کاملNecessary Conditions for the Completion of Partial Latin Squares·
A latin square is an n x n square matrix each of which cells contains a symbol chosen from the set 11,2, ... ,n]; each symbol occurs exactly oncl~ in each row or column of the matrix. A partial latin square is a latin square in which some cells are unoccupied. We consider the problem of obtaining necessary and sufficient conditions for a partial latin square to be completed to a latin square. F...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010